Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("GAMES RA")

Results 1 to 5 of 5

  • Page / 1
Export

Selection :

  • and

THERE ARE NO DE BRUIJN SEQUENCES OF SPAN N WITH COMPLEXITY 2N-1+N+1GAMES RA.1983; JOURNAL OF COMBINATORIAL THEORY. SERIES A.; ISSN 0097-3165; USA; DA. 1983; VOL. 34; NO 2; PP. 248-251; BIBL. 3 REF.Article

(N,K,T)-COVERING SYSTEMS AND ERROR-TRAPPING DECODINGHUI CHAN A; GAMES RA.1981; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1981; VOL. 27; NO 5; PP. 643-646; BIBL. 10 REF.Article

A FAST ALGORITHM FOR DETERMINING THE COMPLEXITY OF A BINARY SEQUENCE WITH PERIOD 2NGAMES RA; HUI CHAN A.1983; IEEE TRANSACTIONS ON INFORMATION THEORY; ISSN 0018-9448; USA; DA. 1983; VOL. 29; NO 1; PP. 144-146; BIBL. 4 REF.Article

ON THE COMPLEXITIES OF DE BRUIJN SEQUENCESHUI CHAN A; GAMES RA; KEY EL et al.1982; J. COMB. THEORY, SER. A; ISSN 0097-3165; USA; DA. 1982; VOL. 33; NO 3; PP. 233-246; BIBL. 13 REF.Article

L'INTESTIN GRELE CHEZ L'ENFANT MARASMIQUECEDRATO AE; TAUBENSLAG L; IBARRA R et al.1972; REV. INTERNATION. PEDIATR.; FR.; DA. 1972; NO 24; PP. 39-41Serial Issue

  • Page / 1